- Hamming bound
- Вычислительная техника: граница Хэмминга
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Hamming bound — In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also known as the sphere packing bound or the volume bound from an interpretation in terms of… … Wikipedia
Gilbert-Varshamov bound — The Gilbert Varshamov bound is a bound on the parameters of a (not necessarily linear) code. It is occasionally known as the Gilbert Shannon Varshamov bound (or the GSV bound ), but the Gilbert Varshamov bound is by far the most popular… … Wikipedia
Singleton bound — In coding theory, the Singleton bound, named after Richard Collom Singleton, is a relatively crude bound on the size of a block code C with block length n, size r and minimum distance d. Contents 1 Statement of the Bound 2 Proof … Wikipedia
Plotkin bound — In the mathematics of coding theory, the Plotkin bound is a bound on the size of binary codes of length n and minimum distance d. Statement of the Bound Let C be a binary code of length n, i.e. a subset of mathbb{F} 2^n. Let d be the minimum… … Wikipedia
Richard Hamming — Infobox Scientist name = Richard Wesley Hamming image width = caption = birth date = birth date|1915|2|11|mf=y birth place = Chicago, Illinois death date = death date and age|1998|1|7|1915|2|11 death place = Monterey, California residence =… … Wikipedia
Johnson bound — The Johnson bound is a bound on the size of error correcting codes.Let C be a q ary code of length n, i.e. a subset of mathbb{F} q^n. Let d be the minimum distance of C, i.e. :d = min {x,y in C, x eq y} d(x,y) where d(x,y) is the Hamming distance … Wikipedia
Distributed source coding — (DSC) is an important problem in information theory and communication. DSC problems regard the compression of multiple correlated information sources that do not communicate with each other.[1] By modeling the correlation between multiple sources … Wikipedia
List of algebraic coding theory topics — This is a list of algebraic coding theory topics. ARQ[disambiguation needed ] Adler 32 BCH code BCJR algorithm Berger code Berlekamp Massey algo … Wikipedia
List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… … Wikipedia
Mutually unbiased bases — In quantum information theory, mutually unbiased bases in Hilbert space Cd are two orthonormal bases and such that the square of the magnitude of the inner product between any basis states and equals the inverse of the dimension d … Wikipedia
Quantum error correction — is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential if one is to achieve fault tolerant quantum computation that can deal not only with noise on … Wikipedia